On the continuous Fermat-Weber problem for a convex polygon using Euclidean distance

نویسندگان

  • Thomas T. C. K. Zhang
  • John Gunnar Carlsson
چکیده

In this paper, we consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expression for finding the average distance from a given point to the continuously distributed customers along the boundary. A Weiszfeld-type procedure is proposed for this model, which is shown to be linearly convergent. We also derive a closed-form formula to find the average distance for a given point to the entire convex polygon, assuming a uniform distribution. Since the function is smooth, convex, and explicitly given, the continuous version of the Fermat-Weber problem over a convex polygon can be solved easily by numerical algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptation of the Probability Changing Method for Weber Problem with an Arbitrary Metric

Fermat-Weber problem in its simple form (unconstrained, single facility, Euclidean metric) is well investigated. Lot of algorithms are also developed for more complicated cases. But the generalized multi-facility problem with barriers, restricted zones and an arbitrary metric has no well-known algorithm for its solving. In this paper, we consider the planar multi-facility Weber problem with res...

متن کامل

On the Fermat-Weber center of a convex object

We show that for any convex object Q in the plane, the average distance from the Fermat-Weber center of Q to the points in Q is at least ∆(P )/7, where ∆(P ) is the diameter of P , and that there exists a convex object for which this distance is ∆(P )/6. We use this result to obtain a linear-time approximation scheme for finding an approximate Fermat-Weber center of a convex polygon Q.

متن کامل

A Heuristic Algorithm for Constrain Single-Source Problem with Constrained Customers

The Fermat-Weber location problem is to find a point in R that minimizes the sum of the weighted Euclidean distances from m given points in R. In this paper we consider the Fermat-Weber problem of one new facilitiy with respect to n unknown customers in order to minimizing the sum of transportation costs between this facility and the customers. We assumed that each customer is located in a none...

متن کامل

The Fermat-torricelli Problem in the Light of Convex Analysis

In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is minimal. This problem was solved by Evangelista Torricelli and was named the Fermat-Torricelli problem. A more general version of the Fermat-Torricelli problem asks for a point that minimizes the sum o...

متن کامل

The Fermat-Torricelli problem in normed planes and spaces

The famous Fermat-Torricelli problem (in Location Science also called the Steiner-Weber problem) asks for the unique point x minimizing the sum of distances to arbitrarily given points x1, . . . ,xn in Euclidean d-dimensional space R. In the present paper, we will consider the extension of this problem to d-dimensional real normed spaces (= Minkowski spaces), where we investigate mainly, but no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1403.3715  شماره 

صفحات  -

تاریخ انتشار 2014